Structure of the Web Searcher’s Query Modifications: Sequential, Branching, Merging, Re-Merging and Non-Sequential Execution
نویسنده
چکیده
This A non-linear model of query modifications during a single session of user searching on the Web is evaluated. In addition to a sequential query modification, in which any query may be reformulation of its direct predecessor, the model allows non-linear interpretation of query reformulations: branching, merging, re-merging (merging of earlier branched chains) and non-sequential execution of logically linear chains of queries. To detect short-term (i.e. during a single time session of interaction with the Web search engine) dependencies between user’s queries we use different query-to-query similarity metrics and consider query-on-query(ies) dependency as similarity of current query to queries submitted earlier in a time session. Usage of different metrics leads to different but complimentary results. The method is applied to query logs of the Yandex, the major Russian search engine. Regardless of difference of results of different metrics, the findings are coincide: about 20% of time sessions containing 3 and more distinct queries contain such combinations of queries which can be interpreted as non-linearities: branchings are occurred in 12% of sessions; mergings are occurred in 6%, and re-mergings in 3%. Number of branches are a little bigger than two; the first branch is smaller then the last. A merging search is frequently executed in the re-merging manner. The last merging chain is smaller then the first one. Keywords— query modification, branching, merging, re-merging
منابع مشابه
Incremental update on sequential patterns in large databases by implicit merging and efficient counting
Current approaches for sequential pattern mining usually assume that the mining is performed in a static sequence database. However, databases are not static due to update so that the discovered patterns might become invalid and new patterns could be created. In addition to higher complexity, the maintenance of sequential patterns is more challenging than that of association rules owing to sequ...
متن کاملTarget setting in the process of merging and restructuring of decision-making units using multiple objective linear programming
This paper presents a novel approach to achieving the goals of data envelopment analysis in the process of reconstruction and integration of decision-making units by using multiple objective linear programming. In this regard, first, we review inverse data envelopment analysis models for data reconstruction and integration. We present a model with multi-objective linear programming structure in...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملموازی سازی شبیه سازی پدیده ناپایداری دوجریانی به روش PIC
Two stream instability in plasma is simulated by PIC method. The execution time of the sequential and parallizable sections of the program is measured. The sequential program is parallelized with the help of the MPI functions. Then, the execution time of the sequential program versus the number of the grid points and the execution time of the parallel program on 3 and 5 processors versus the nu...
متن کاملSearch Result Merging and Ranking Strategies in Meta-Search Engines: A Survey
MetaSearch is utilizing multiple other search systems to perform simultaneous search. A MetaSearch Engine (MSE) is a search system that enables MetaSearch. To perform a MetaSearch, user query is sent to multiple search engines; once the search results returned, they are received by the MSE, then merged into a single ranked list and the ranked list is presented to the user. When a query is submi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011